Dynamics with low-level fractionality

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Dynamics with low-level fractionality

The notion of fractional dynamics is related to equations of motion with one or a few terms with derivatives of a fractional order. This type of equation appears in the description of chaotic dynamics, wave propagation in fractal media, and field theory. For the fractional linear oscillator the physical meaning of the derivative of order ao2 is dissipation. In systems with many spacially couple...

متن کامل

On fractionality of the path packing problem

Given an undirected graph G = (N,E), a subset T of its nodes and an undirected graph (T, S), G and (T, S) together are often called a network. A collection of paths in G whose end-pairs lie in S is called an integer multiflow. When these paths are allowed to have fractional weight, under the constraint that the total weight of the paths traversing a single edge does not exceed 1, we have a frac...

متن کامل

Live Birth Rate following Intrauterine Insemination in Women with Low or Very Low Level of Serum Anti-müllerian Hormone

Background: While anti-Müllerian hormone (AMH) level allows quantitative evaluation of ovarian reserve, its predictive value for live births following assisted reproductive technology cycles has remained controversial. The aim of the present study was to assess the importance of AMH in predicting live birth following intrauterine insemination (IUI) in the case of low or very lo...

متن کامل

On the fractionality of the path packing problem

In this paper, we study fractional multiflows in undirected graphs. A fractional multiflow in a graph G with a node subset T, called terminals, is a collection of weighted paths with ends in T such that the total weights of paths traversing each edge does not exceed 1. Well-known fractional path packing problem consists of maximizing the total weight of paths with ends in a subset S of TxT over...

متن کامل

Data Refinement with Low-Level Pointer Operations

We present a method for proving data refinement in the presence of low-level pointer operations, such as memory allocation and deallocation, and pointer arithmetic. Surprisingly, none of the existing methods for data refinement, including those specifically designed for pointers, are sound in the presence of low-level pointer operations. The reason is that the low-level pointer operations allow...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Physica A: Statistical Mechanics and its Applications

سال: 2006

ISSN: 0378-4371

DOI: 10.1016/j.physa.2005.12.015